Quantum Iterative Deepening with an Application to the Halting Problem
نویسندگان
چکیده
منابع مشابه
Quantum Iterative Deepening with an Application to the Halting Problem
Classical models of computation traditionally resort to halting schemes in order to enquire about the state of a computation. In such schemes, a computational process is responsible for signaling an end of a calculation by setting a halt bit, which needs to be systematically checked by an observer. The capacity of quantum computational models to operate on a superposition of states requires an ...
متن کاملSolving the Traveling Tournament Problem with Iterative-Deepening A
We give an overview of our journal paper on applying iterative-deepening A* to the traveling tournament problem, a combinatorial optimization problem from the sports scheduling literature. This approach involved combining past ideas and creating new ideas to help reduce node expansion. This resulted in a state-of-the-art approach for optimally solving instances of the traveling tournament probl...
متن کاملThe halting problem for universal quantum computers
The halting of universal quantum computers is shown to be incompatible with the constraint of unitarity of the dynamics. The prospects of using quantum dynamics to process information have opened up new research horizon. While most of the activities is in the theoretical study and experimental realisation of quantum networks [1], the principles –and the halting problem, in particular– of a univ...
متن کاملEnhanced Iterative-Deepening Search
|Iterative-deepening searchesmimic a breadthrst node expansion with a series of depthrst searches that operate with successively extended search horizons. They have been proposed as a simple way to reduce the space complexity of bestrst searches like A* from exponential to linear in the search depth. But there is more to iterative-deepening than just a reduction of storage space. As we show, th...
متن کاملApproximations to the Halting Problem
The halting set Kr = (x I r converges}, for any G6del numbering ~ = {~0, ~1 ,-..}, is nonrecursive. It may be possible, however, to approximate Kr by recursive s e t s . We note several results indicating that the degrees of recursive approximability of halting sets in arbitrary GSdel numberings have wide variation, while restriction to "optimal GSdel numberings" only narrows the possibilities ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: PLoS ONE
سال: 2013
ISSN: 1932-6203
DOI: 10.1371/journal.pone.0057309